Distributed real-time computing framework using in-storage processing

ABSTRACT

According to one general aspect, a scheduler computing device may include a computing task memory configured to store at least one computing task. The computing task may be executed by a data node of a distributed computing system, wherein the distributed computing system includes at least one data node, each data node having a central processor and an intelligent storage medium, wherein the intelligent storage medium comprises a controller processor and a memory. The scheduler computing device may include a processor configured to assign the computing task to be executed by either the central processor of a data node or the intelligent storage medium of the data node, based, at least in part, upon an amount of data associated with the computing task.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority under 35 U.S.C. §119 to Provisional Patent Application Ser. No. 62/057,203, entitled “DISTRIBUTED REAL-TIME COMPUTING FRAMEWORK USING IN-STORAGE PROCESSING” filed on Sep. 29, 2014. The subject matter of this earlier filed application is hereby incorporated by reference.

TECHNICAL FIELD

This description relates to processing data, and more specifically, processing data within a distributed computing system.

BACKGROUND

Distributed computing is generally a field of computer science that studies or utilizes distributed systems. A distributed computing system is traditionally a system in which components located on networked computers communicate and coordinate their actions by passing messages amongst themselves. The components interact with each other in order to achieve a common goal. General characteristics of distributed systems may include concurrency of components, lack of a global clock, and allowances for independent failure of components. Examples of distributed systems vary from massively multiplayer online games to peer-to-peer applications.

The word “distributed” in terms such as “distributed system”, “distributed programming”, “distributed file system”, etc. originally referred to computer networks where the individual computers were physically distributed within some geographical area. The term is nowadays used in a much wider sense, and often refers to autonomous processes that run within the same physical location and interact with each other by message passing.

A distributed computing system may have a common goal, such as solving a large computational problem. For example, in some distributed systems, the computational problem may be broken down into a plurality of smaller tasks that may be executed simultaneously or in parallel, and these tasks may be assigned to various computers of the distributed system. In such a system, the larger computational problem may be solved more quickly by leveraging the execution power of the distributed system to process the problem substantially in parallel, as opposed to a single computer processing the problem sequentially.

SUMMARY

According to one general aspect, a scheduler computing device may include a computing task memory configured to store at least one computing task. The computing task may be executed by a data node of a distributed computing system, wherein the distributed computing system includes at least one data node, each data node having a central processor and an intelligent storage medium, wherein the intelligent storage medium comprises a controller processor and a memory. The scheduler computing device may include a processor configured to assign the computing task to be executed by either the central processor of a data node or the intelligent storage medium of the data node, based, at least in part, upon an amount of data associated with the computing task.

According to another general aspect, a method may include receiving a computing task, wherein the computing task includes a plurality of operations. The method may include allocating the computing task to a data node, wherein the data node includes a central processor and an intelligent storage medium, and wherein the intelligent storage medium includes a controller processor and a memory. The method may include dividing the computing task into at least a first chain of operations and a second chain of operations. The method may include assigning the first chain of operations to the intelligent storage medium of the data node. The method may also include assigning the second chain of operations to the central processor of the data node.

According to another general aspect, a data node may include a central processor configured to execute at least one of a first set of operations upon data stored by an intelligent storage medium. The intelligent storage medium may include a memory configured to store data in a semi-permanent manner, and a controller processor configured to execute at least one of a second set of operations upon data stored by the intelligent storage medium. The data node may include a network interface configured to receive a plurality of operations from a scheduling computing device. The data node may be configured to: divide the computing task into at least the first set of operations and the second set of operations, assign the first set of operations to the central processor for execution, and assign the second set of operations to the intelligent storage medium for execution.

The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and from the claims.

A system and/or method for processing data, and more specifically, processing data within a distributed computing system, substantially as shown in and/or described in connection with at least one of the figures, as set forth more completely in the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an example embodiment of a system in accordance with the disclosed subject matter.

FIG. 2 is a block diagram of an example embodiment of a system in accordance with the disclosed subject matter.

FIG. 3 is a table of an example embodiment of a classification system in accordance with the disclosed subject matter.

FIG. 4 is a block diagram of an example embodiment of a chain of operations in accordance with the disclosed subject matter.

FIG. 5 is a flowchart of an example embodiment of a technique in accordance with the disclosed subject matter.

FIG. 6 is a flowchart of an example embodiment of a technique in accordance with the disclosed subject matter.

FIG. 7 is a schematic block diagram of an information processing system that may include devices formed according to principles of the disclosed subject matter.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

Various example embodiments will be described more fully hereinafter with reference to the accompanying drawings, in which some example embodiments are shown. The present disclosed subject matter may, however, be embodied in many different forms and should not be construed as limited to the example embodiments set forth herein. Rather, these example embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the present disclosed subject matter to those skilled in the art. In the drawings, the sizes and relative sizes of layers and regions may be exaggerated for clarity.

It will be understood that when an element or layer is referred to as being “on,” “connected to” or “coupled to” another element or layer, it can be directly on, connected or coupled to the other element or layer or intervening elements or layers may be present. In contrast, when an element is referred to as being “directly on”, “directly connected to” or “directly coupled to” another element or layer, there are no intervening elements or layers present. Like numerals refer to like elements throughout. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items.

It will be understood that, although the terms first, second, third, etc. may be used herein to describe various elements, components, regions, layers and/or sections, these elements, components, regions, layers and/or sections should not be limited by these terms. These terms are only used to distinguish one element, component, region, layer, or section from another region, layer, or section. Thus, a first element, component, region, layer, or section discussed below could be termed a second element, component, region, layer, or section without departing from the teachings of the present disclosed subject matter.

Spatially relative terms, such as “beneath”, “below”, “lower”, “above”, “upper” and the like, may be used herein for ease of description to describe one element or feature's relationship to another element(s) or feature(s) as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if the device in the figures is turned over, elements described as “below” or “beneath” other elements or features would then be oriented “above” the other elements or features. Thus, the exemplary term “below” can encompass both an orientation of above and below. The device may be otherwise oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly.

The terminology used herein is for the purpose of describing particular example embodiments only and is not intended to be limiting of the present disclosed subject matter. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

Example embodiments are described herein with reference to cross-sectional illustrations that are schematic illustrations of idealized example embodiments (and intermediate structures). As such, variations from the shapes of the illustrations as a result, for example, of manufacturing techniques and/or tolerances, are to be expected. Thus, example embodiments should not be construed as limited to the particular shapes of regions illustrated herein but are to include deviations in shapes that result, for example, from manufacturing. For example, an implanted region illustrated as a rectangle will, typically, have rounded or curved features and/or a gradient of implant concentration at its edges rather than a binary change from implanted to non-implanted region. Likewise, a buried region formed by implantation may result in some implantation in the region between the buried region and the surface through which the implantation takes place. Thus, the regions illustrated in the figures are schematic in nature and their shapes are not intended to illustrate the actual shape of a region of a device and are not intended to limit the scope of the present disclosed subject matter.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosed subject matter belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

Hereinafter, example embodiments will be explained in detail with reference to the accompanying drawings.

FIG. 1 is a block diagram of an example embodiment of a system 100 in accordance with the disclosed subject matter. In various embodiments, the system 100 may include a distributed computing system and execute a distributed application; although, it is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In the illustrated embodiment, the system 100 may include a plurality of data nodes 108, and a scheduler computing device or scheduler 104. In such an embodiment, the plurality of data nodes 108 may in turn include individual data nodes (e.g., data nodes 106, 106 b, and 106 c, etc.). As described above, in various embodiments of a distributed computing system, the scheduler 104 may include or have one or more computing tasks 172 that are to be performed or executed by the distributed computing system.

In various embodiments, the scheduler 104 may include a computing device, such as, for example, a laptop, desktop, workstation, personal digital assistant, smartphone, tablet, and other appropriate computers, etc. or a virtual machine or virtual computing device thereof. In various embodiments, the scheduler 104 may be used by a user (not shown). In various embodiments, the scheduler 104 may include a processor 182 configured to execute one or more machine executable instructions or pieces of software, firmware, or a combination thereof. The scheduler 104 may include, in some embodiments, a memory 184 configured to store one or more pieces of data, either temporarily, permanently, semi-permanently, or a combination thereof. Further, the memory 184 may include volatile memory, non-volatile memory or a combination thereof. In various embodiments, the scheduler 104 may include a storage medium 185 configured to store data in a semi-permanent or substantially permanent form. In various embodiments, the storage medium 185 may be included by the memory 184.

In various embodiments, the scheduler 104 may include one or more network interfaces 186 configured to allow the scheduler 104 to be part of and communicate via a communications network, which may use various protocols. Examples of a Wi-Fi protocol may include, but are not limited to: Institute of Electrical and Electronics Engineers (IEEE) 802.11g, IEEE 802.11n, etc. Examples of a cellular protocol may include, but are not limited to: IEEE 802.16m (a.k.a. Wireless-MAN (Metropolitan Area Network) Advanced), Long Term Evolution (LTE) Advanced), Enhanced Data rates for GSM (Global System for Mobile Communications) Evolution (EDGE), Evolved High-Speed Packet Access (HSPA+), etc. Examples of a wired protocol may include, but are not limited to: IEEE 802.3 (a.k.a. Ethernet), Fibre Channel, Power Line communication (e.g., HomePlug, IEEE 1901, etc.), etc. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In various embodiments, the scheduler 104 may include one or more other hardware components 183 (e.g., a display or monitor, a keyboard, a mouse, a camera, a fingerprint reader, a video processor, etc.). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In various embodiments, the data nodes 108 may each include similar hardware components as those described in reference to the scheduler 104 (e.g., network interface 186, other components 183, etc.). In such an embodiment, the data nodes 108 may also or alternately include the components described below (e.g., intelligent storage medium (ISM) 116, central processor 112, etc.). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

The data nodes 108 may include the computing devices that are employed to execute the computing tasks 172. The scheduler 104 may be configured to assign the computing tasks 172 to the various data nodes 108 for execution.

In such an embodiment, each computing task 172 may be associated with a respective piece of data (e.g., data 182 i, etc.). That piece of data may be stored on only one (or possibly more) data node (e.g., data node 106, etc.). The scheduler 104 may maintain an indication 170 that indicates which pieces of data are stored by which data nodes 108. In such an embodiment, when the scheduler 104 decides which data node will be assigned the computing task 172, it may examine the indication 170 and determine what data node(s) are storing the associated data.

For example, if a first computing task 172 is associated with data 182 i, it might not be assigned to data node 106 b, as data 182 i is not found within data node 106 b. Instead, that computing task 172 may be assigned to data node 106, as data node 106 stores the data 182 i. Likewise, a second computing task 172 that is associated with data 184 i might not be assigned to data node 106 (as data 184 i is not stored there), but to data node 106 b (which stores data 184 i). In such an embodiment, the scheduler 104 may generate a computing task 172 to move data between data nodes (e.g., move data 184 i from data node 106 b to data node 106), but that is mostly outside the scope of the disclosed subject matter.

Traditionally, a data node (e.g., data node 106 c, etc.) included a central processing unit (CPU) or central processor 112, a memory 114 (e.g., a random access memory (RAM), etc.), and a storage medium 118 that in turn included a memory 143 (e.g., a magnetic memory, a solid-state memory, etc.). Traditionally, the only processor able to perform the task in the data node would be the central processor 112. Therefore, data had to be moved throughout the data node 106 c such that the central processor 112 could have access to it. This involved moving the data from/to each of the three main components (storage medium 118, memory 114, and central processor 112). Each movement of the data incurred additional power consumption and took a certain amount of time. Further, as the system resources provided by the central processor 112 and memory 114 (e.g., compute cycles, storage space) were limited, the movement of data consumed those system resources, too.

In the illustrated embodiment, the plurality of data nodes 108 may include components that allow the movement of data to be reduced, and hence the overhead incurred by such movement (e.g., power consumed, travel and processing time, etc.) to be reduced.

In the illustrated embodiment, the data nodes (e.g., data node 106, etc.) may still include a central processing unit (CPU) or central processor 112, a memory 114 (e.g., a random access memory (RAM), etc.) but may now also include an intelligent storage medium (ISM) 116. In such an embodiment, the intelligent storage medium 116 may include a controller processor 142 and a memory 143 (e.g., a magnetic memory, a solid-state memory, etc.). In this context, the traditional storage medium, without an externally accessible or assignable controller processor 142, may be referred to as a “simple storage medium (SSM)” (e.g., SSM 118, etc.).

In such an embodiment, the data node 106 may include two (or more) processors. In the illustrated embodiment, the system 100 may be configured to assign computing tasks 172 not just to a data node, as a whole, but to specific components within that data node.

In such an embodiment, this may allow the movement of data (e.g., data 184 i, etc.) to be reduced or effectively eliminated. For example, if the controller processer 142 is assigned to perform the computing task 172, the data need not be moved outside of the ISM 116, as described below.

As a first example, that shows a case similar to the traditional usage, in the illustrated embodiment, the scheduler 104 may assign a computing task 172 not just to data node 106, but also to the central processor 112. In such an embodiment, the movement of the data 182 i may occur similarly to the traditional case. Specifically, data 182 i may be stored permanently or semi-permanently in the memory 143 of the intelligent storage medium 116. When the computing task 172 is to be executed, this data 182 i may be copied from the ISM 116 to the memory 114. The central processor 112 may then access the data 182 i from the memory 114. The results of the computing task 172 or the output data 182 o may be stored within the memory 114. Eventually (e.g., at the end of the computing task, etc.), the output data 182 o may be permanently or semi-permanently stored within the ISM 116.

As a second example that deviates more substantially from the traditional usage case, in the illustrated embodiment, the scheduler 104 may assign a computing task 172 not just to data node 106 b, but also to the intelligent storage medium 116. In such an embodiment, the movement of the data 184 i may be drastically reduced compared to the first example above or the traditional case, also described above. In such an embodiment, the data 184 i may be stored permanently or semi-permanently in the memory 143 of the intelligent storage medium 116. When a computing task 172 is to be executed, this data 184 i may be copied or accessed from the memory 143 by the controller processor 142. In such an embodiment, the communication bus or channel (not shown) between the ISM 116 and the memory 114 may be avoided, thus reducing consumption of the previously described system resources. The results of the computing task 172 or the output data 184 o may be stored permanently or semi-permanently within the memory 143 (again avoiding the use of system resources to move the data between the memory 114 and the ISM 116).

As described below in reference to FIGS. 2, 3, and 4, the scheduler 104 may not be solely concerned with minimizing the system resources used when moving data about a data node (e.g., data node 106, etc.). For example, not all computing tasks 172 may be capable of being performed by a controller processor 142. Traditionally, a controller processor 142's function may not have included the performance of computing tasks 172. Instead, the controller processor 142's two primary functions may have been (1) to manage the communication between the ISM 116 and the rest of any apparatus (e.g., data node 106, etc.) that may include the ISM 116, and (2) manage the storage of data within the memory 143. In the illustrated embodiment, an ISM's controller processor 142 may be configured to perform these traditional functions, but also may be configured to execute computing tasks 172. For example, an ISM 116 that includes a solid-state drive (SSD) may have a controller processor 142 configured to perform data management functions, such as, for example error-correcting code (ECC) computation, wear leveling management, bad block mapping, read scrubbing and read disturb management, read and write caching, garbage collection, and/or encryption, etc.

In some embodiments, the controller processor 142 may be capable of only performing a limited set or, more generally, a first set of operations or instructions. In such an embodiment, the instructions or operation codes (opcodes) detailing how to perform the higher-level operations of the computing tasks 172, or how to translate the higher-level operations of the computing tasks 172 into lower-level operations understandable by the controller processor 142 may be stored in a firmware 160 or memory of the controller processor 142. In some embodiments, such firmware 160 may be occasionally updated or edited to adjust or add new capabilities (e.g., new operations that may be performed, etc.) to the controller processor 142. In another embodiment, the operations or some of the operations may be hardwired or physically part of the structure of the controller processor 142. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In an embodiment in which the control set of the controller processor 142 is a subset of all possible operations, the scheduler 104 may be limited in its ability to assign tasks 172 to the ISM 116 (as opposed to the central processor 112) by the operations supported by the controller processor 142. In various embodiments, different data nodes (e.g., data node 106 and data node 106 b, etc.) may support different operations. For example, a first ISM (e.g., the ISM 116 of data node 106) may be made by a different manufacturer, have a different version of the firmware 160, etc., than a second data node (e.g., the ISM 116 of data node 106 b). As such, the two data nodes may support different capabilities or operations. In some embodiments, the scheduler 104 may assign a task 172 to the ISM 116 of the first data node, but (due to differing capabilities) assign the same or similar task 172 to the central processor 112 of the second data node. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In such an embodiment, it may be possible to upgrade or alter the firmware 160 to change the operations supported by the ISM 116 or alter the way an operation is performed by the ISM 116, etc. In another embodiment, the firmware 160 or other structure to perform the operations may be wholly or partially fixed or unalterable. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

Further, in various embodiments, the plurality of data nodes 108 may include a mixture of ISMs 116 and SSMs 118. In some embodiments, a different sets or groups of pluralities of data nodes 108 may exist. In such an embodiment, each set or group may include or be divided by different characteristics and/or capabilities. It is understood that the disclosed subject may include embodiments with both heterogeneous and homogeneous environments.

In another embodiment, the central processor 112 may be more powerful than the controller processor 142. In such an embodiment, the performance of a computing task 172 by the central processor 112 may be more efficient than the performance would be via the controller processor 142. In some embodiments, the benefits of such efficiency may outweigh the increase in usage of system resources incurred by moving the data to a place accessible by the central processor 112. In such an embodiment, the scheduler 104 may be configured to consider the overall efficiency of the system 100 when assigning computing tasks 172 to the processors 112 or 142.

In yet another embodiment, a computing task 172 may include a series or chain of smaller operations. In such an embodiment, the scheduler 104 may be configured to break or divide a larger computing task 172 into two or more smaller computing tasks 172. In various embodiments, the scheduler 104 may be able to create smaller computing tasks 172 that include only operations that may be performed by a single processor (e.g., either the central processor 112 or the controller processor 142). In such an embodiment, the scheduler 104 may be configured to create computing tasks 172 in a way that increases the efficiency of the system 100.

For example, in one embodiment, a larger computing task 172 may need to be performed, in part, by the central processor 112 but may also include a second part that may be performed by the controller processor 142. In such an embodiment, the scheduler may be configured to break or divide the larger computing task 172 such that a first part or smaller computing task may be performed by the central processor 112 and a second part or smaller computing task may be performed by the controller processor 142.

In one embodiment, the scheduler 104 may select a break point or operation to split the larger computing task 172 based on the amount of data that would be moved or copied from the ISM 116 to the memory 114 (or other component). In various embodiments, it may be beneficial to reduce the amount of data copied between the two components. In another embodiment, the efficiency of computation may be a concern For example, it may be more efficient for the central processor 112 to execute certain operations even if they result in more data than is desirable. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In yet another embodiment, the larger computing task 172 may be split or divided into more than two sets or chains of operations. For example, a first smaller computing task or chain of operations may be assigned or performed by the ISM 116. Then, at a determined point or operation, a second smaller computing task or chain of operations may be assigned or performed by the central processor 112 (e.g., when a complex operation is encountered, the amount of data to copy is small, etc.). Finally, a third smaller computing task or chain of operations may be assigned or performed by the ISM 116, and the larger computing task 172 may conclude with the output data being stored within the ISM 116. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In some embodiments, the scheduler 104 may be configured to dictate or decided where the output data of a computing task 172 or chain of operations is to be stored. Returning to the above three smaller computing task example, the scheduler 104 may dictate that the output data of the first smaller computing task be stored in the memory 114 (e.g., as input data for the second smaller computing task). Likewise, the scheduler 104 may dictate that the output data of the third smaller computing task be stored in the ISM's memory 143. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In one embodiment, as described above, the scheduler 104 may even be configured to dictate that the output data be stored in an entirely different data node. For example, the scheduler 104 may dictate that the output data (e.g., data 182 o, etc.) be stored in another data node (e.g., data node 106 b, etc.) and not the back into the ISM's memory 143. In such an embodiment, the scheduler 104 may be able to manage the entire plurality of data nodes 108, not just the scheduling of computing tasks 172 to a particular data node or processor. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In yet another embodiment, the system 100 may be configured such that the scheduler computing device 104 may assign a plurality of operations or tasks 172 to a data node (e.g., data node 106, etc.) and then the data node itself may divide the larger computing task 172 into more than two sets or chains of operations. As described above, a first smaller computing task or chain of operations may be assigned by the data node 106 to be performed by the data node's ISM 116. Then, a second smaller computing task or chain of operations may be assigned by the data node to be performed by the data node's central processor 112. The larger computing task 172 may be further divided into third or further smaller computing tasks, as described above, except that in this embodiment the data node may perform the division and assignment instead of the scheduler computing device 104. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

For the sake of clarity of example, herein the disclosed subject matter will be described to embodiments in which the scheduler computing device 104 performs the division of the larger computing task 172 into smaller computing tasks and the assignment thereof. However, it is understood that this is merely one possible embodiment to which the disclosed subject matter is not limited.

FIG. 2 is a block diagram of an example embodiment of a system 200 in accordance with the disclosed subject matter. In various embodiments, the system 200 shows a data node 106 that includes a CPU or central processor 112, a memory 114, and an intelligent storage medium (ISM) 114. The ISM 116 may include a controller processor 142 and a memory 143, as described above.

In the illustrated embodiment, it is shown that a larger computing task or chain of operations may be divided into smaller computing tasks or chains of operations (e.g., off-loaded operations 202, host computed operations 204, etc.) and then assigned to be performed by either the central processor 112 or the ISM 116. In various embodiments, more than two smaller computing tasks may exist but two are shown for non-limiting, illustrative purposes.

In the illustrated embodiment, the scheduler computing device may detect that a first set or chain of operations may be performed by the ISM 116. In this context, these operations may be considered to be off-loaded from the central processor 112 that would traditionally perform them. These operations may be included as off-loaded operations 202, and may be assigned to the ISM 116.

In such an embodiment, the off-loaded operations 202 may be associated with the input data 282 i that is stored in the ISM's memory 143. This input data 282 i may be accessed by the controller processor 142. The controller processor 142 may execute or perform the off-loaded operations 202, without the aid or, in some embodiments, the knowledge of the central processor 112. In such an embodiment, the central processor 112 may be busy executing a different set of operations (not shown) that may access different data and/or be related to a different computing task. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited. The execution of the off-loaded operations 202 may result in the output data 282 o.

In various embodiments, at the end of the execution of the off-loaded operations 202, the output data 282 o may be stored either within the ISM's memory 143 or within the memory 114. In one embodiment, if the next chain of operations or computing task that accesses the data 282 o is one assigned to the central processor 112, the data 282 o may be copied from the ISM 116 to the memory 114 (e.g., like the data 182 i of FIG. 1, etc.). In another embodiment, if the next chain of operations or computing task that accesses the data 282 o is one assigned to the ISM 116, or if the off-loaded operations 202 are the final operations in the larger computing task, etc. it may be more efficient and convenient to have the data 282 o stored locally within the ISM's memory 143. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In the illustrated embodiment, the scheduler may be aware that the next chain of operations or computing task is one assigned to the central processor 112. As such, in the illustrated embodiment, the scheduler may dictate or indicate that the final output of the off-loaded operations 202 is to be stored in the memory 114 of the data node 106, and not the ISM's memory 143. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In the illustrated embodiment, the next set or chain of operations may include operations that are to be performed by the central processor 112. In such an embodiment, these operations may be referred to as “host computed operations 204” and may be assigned to the host or central processor 112. In various embodiments, the central processor 112 may read the input data 284 i from the memory 114 (e.g., random access memory (RAM), etc.). The central processor 112 may execute the operations 204, performing whatever data manipulations are dictated by those host-computed operations 204. In some embodiments, the intermediate results or data may be stored within the central processor 112's internal memories (e.g., registers, caches, etc.) and/or in the memory 114.

In one embodiment, at the end of the host-computed operations 204, the final output data 284 o may be stored to the memory 114. As described above, in various embodiments, the scheduler may dictate that the final output data 284 o be stored in the memory 114 or the ISM 116. In another embodiment, the scheduler may be configured only to dictate the final storage location when off-loaded operations 202 are involved.

In the illustrated embodiment, the output data 284 o may be stored in the memory 114. In such an embodiment, a final operation (e.g., final storage 206, etc.) may move the output data 284 o from the memory 114 to the ISM 116. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

FIG. 3 is a table 300 of an example embodiment of a classification system in accordance with the disclosed subject matter. In the illustrated embodiment, the table 300 shows a number of example operations, subroutines, or functions. The table 300 then shows two example classification or categorization schemes that may be employed with the disclosed subject matter. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In the illustrated embodiment, group 312 shows a number of example operations in which the size of the input data is expected to be greater than the size of the output data. In such an embodiment, it may be desirable not to transfer the larger input data across the communications bus to the main memory of the data node. Instead, it may be more desirable to transfer, if necessary and after the operation has completed, the smaller output data across the communications bus to the main memory of the data node (e.g., if needed for a host-computed operation, etc.).

The table 300 lists a few example operations that may be included in a group where the size of the input data is expected to be greater than the size of the output data. These example operations may include, in various embodiments: Filter( ), Sample( ), GroupByKey( ), ReduceByKey( ), PartitionBy( ), Count( ), Reduce( ), and LookUp( ). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In the illustrated embodiment, group 314 shows a number of example operations in which the size of the input data is expected to be roughly equal to the size of the output data. In such an embodiment, it may or may not be desirable to transfer the input data across the communications bus to the main memory of the data node. In some embodiments, the desirability of this relatively neutral action may depend upon what operations will occur next in the chain of operations. If the next operation is to be performed by the central processor, it may be desirable to transfer the input data now, and perform the operation of group 314 by the central processor. Conversely, if the next operation is to be performed by the controller processor, it may be desirable to keep the data and operation on the intelligent storage medium. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

The table 300 lists a few example operations that may be included in a group where the size of the input data is expected to be roughly equal to the size of the output data. These example operations may include, in various embodiments: Map( ), FlatMap( ), MapValues( ), Collect( ), and Sort( ). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In the illustrated embodiment, group 316 shows a number of example operations in which the size of the input data is expected to be less than the size of the output data. In such an embodiment, it may be desirable to transfer the larger input data across the communications bus to the main memory of the data node. Indeed, it may be desirable to transfer, before the operation has completed, the smaller input data across the communications bus to the main memory of the data node (e.g., if needed for a host-computed operation, etc.).

The table 300 lists a few example operations that may be included in a group where the size of the input data is expected to be less than the size of the output data. These example operations may include, in various embodiments: Union( ), Join( ), Cogroup( ), CrossProduct( ). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

The second or middle column of table 300 illustrates a first categorization or classifying scheme that may be employed with the disclosed subject matter. In the illustrated embodiment, the operations may be labeled or identified as belonging to one of two categories: an off-loadable classification 322 or a host-computable classification 326.

In the illustrated embodiment, operations in which the size of the output data is expected to be less than or equal to the input data may be classified into the off-loadable classification 322 and performed by the ISM's controller processor. In such an embodiment, data transfers between the data node's main memory and the ISM may be reduced, as not occurring, only occurring when the data size is relatively small, or no worse than if the input data was transferred.

In the illustrated embodiment, operations in which the size of the output data is expected to be greater than to the input data may be classified into the host computable classification 326 and performed by the data node's central processor. In such an embodiment, data transfers between the data node's main memory and the ISM may be reduced, as occurring when the input data size is relatively small. In some embodiments, the operations of group 314 may be part of the host computable classification 326 and not the off-loadable classification 322 as the difference in the input and output data sizes may be negligible for that group. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

The third or right column of table 300 illustrates a second categorization or classifying scheme that may be employed with the disclosed subject matter. In the illustrated embodiment, the operations may be labeled or identified and belonging to one of three categories: an off-loadable classification 332, an equivocal classification 334, or a host-computable classification 336. It is understood that the above are merely a few illustrative examples of classification schemes to which the disclosed subject matter is not limited.

In the illustrated embodiment, operations in which the size of the output data is expected to be less than the input data may be classified into the off-loadable classification 332 and performed by the ISM's controller processor. In such an embodiment, data transfers between the data node's main memory and the ISM may be reduced, as not occurring, only occurring when the data size is relatively small, or no worse than if the input data was transferred.

In the illustrated embodiment, operations in which the size of the output data is expected to be greater than to the input data may be classified into the host computable classification 336 and performed by the data node's central processor. In such an embodiment, data transfers between the data node's main memory and the ISM may be reduced, as occurring when the output data size is relatively small.

In the illustrated embodiment, operations in which the size of the output data is expected to be roughly equal to the input data may be classified into the equivocal classification 334. In such an embodiment, operations of this class may not be a priori assigned to either central processor or the ISM. Instead, as the cost saving incurred by transferring or not transferring the input/output data may be low or negligible, the scheduler may feel that these operations (e.g., group 314) may be assigned either place, as is most beneficial for the overall processing of operations.

In such an embodiment (e.g., that shown in FIGS. 6a and 6b , etc.) the processor assignment of these equivocal operations 334 may depended upon what the next operation's classification is. For example, if an equivocal operation is sandwiched between two off-loadable operations it may not make sense to assign the equivocal operation to the central processor (incurring the cost of two data transfers). However, if an equivocal operation is sandwiched between an off-loadable operation and a host-computable operation it may make sense to assign the equivocal operation to the central processor (or vice versa). In such an embodiment, a data transfer would occur at either the end or beginning of the equivocal operation, but neither data transfer would be much worse as the size of the input/output data would be roughly equal. But, the equivocal operation might benefit from the greater computing power of the central processor. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In various embodiments, the relative sizes between the input data and output data may be based upon a tolerance or threshold measure of different sizes. In another embodiment, the sizes of the input/output data may be based upon predefined averages or historical expectations and not dynamically evaluated for each operation and piece of data associated with that particular instance of the operation. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

Further, it is understood that while these groups (e.g., groups 312, 314, and 316) have been delimitated by the size of the input data compared to the output data, in various other embodiments, other concerns may cause an operation to be part of a group or classification. For example, some operations may not be performable by the intelligent storage medium (e.g., due to lack of firmware support, etc.). In such an embodiment, the operation may be considered a host-computable operation (e.g., within group 316) regardless of the size of the input data compared to the output data. In another embodiment, the controller processor may simply be very inefficient at performing an operation and it may be classified as a host-computable operation regardless of the size of the input data compared to the output data. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

In various embodiments, a scheduler may assign an off-loadable operation (e.g., of classifications 322 or 332) to a central processor and not to the usual ISM's controller processor. For example, off-loadable operations (e.g., of group 312) result in an amount of output data less than their input data. As such, it may be beneficial to transfer data between the data node's memory and the ISM after an off-loadable operation has been executed. In such an embodiment, if a previous host-computable operation (e.g. of group 316) resulted in a large amount of output data, it may be beneficial to the system to assign an off-loadable operation to the central processor. In such an embodiment, the amount of data may be reduced before it is transferred back to the ISM (e.g., for final storage, further execution of other off-loadable operations, etc.). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

Conversely, a scheduler may assign a host-computable operation (e.g., of classifications 322 or 332) to an ISM's controller processor and not to the usual central processor (if physically possible). For example, if a sole (or a very few) host-computable operations exists at the very end of a larger computing task and if the ISM's controller processor is physically capable of executing those operations, it may be beneficial to the system to simply avoid the ISM to memory data transfer by having the ISM just finish off the larger computing task and execute the host-computable operation. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

FIG. 4 is a block diagram 400 of an example embodiment of a chain of operations in accordance with the disclosed subject matter. FIG. 4 illustrates how a scheduler may take a larger computing task, classify each of the operations that comprise the larger computing task, divide the larger computing task into two or more smaller computing tasks or chains of operations, and then assign each of those smaller computing tasks or chains of operations to either the central processor or the ISM for execution. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In the illustrated embodiment, portion 410 shows how a larger computing task may include a series or chain of operations that execute one after the other. In the illustrated embodiment, this larger computing task includes, in order, operation #1 411, operation #2 412, operation #3 413, operation #4 414, operation #5 415, and operation #6 416. In various embodiments, these operations may be received by the scheduler without any form of pre-classification. In another embodiment, these operations may be tagged or marked as favoring assignment to a particular processor (e.g., the data node's central processor, the ISM's controller processor, etc.). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

Portion 420 of FIG. 4 shows that the scheduler may classify or categorize each operation of the larger computing task. In the illustrated embodiment, operation #1 421 and operation #2 422 may both be classified as off-loadable (OL) operations, and may be considered part of a first smaller computing task 428 that will be assigned to the ISM. Operation #3 423, however, may be classified as an equivocal (E) operation and its assignment (both to a particular smaller computing task and/or processor) may not be so clear-cut. Operation #4 424 may also be classified as off-loadable (OL) operation that will be assigned to the ISM.

In one embodiment (not shown), the scheduler may create three computing tasks from the four operations 421, 422, 423, and 424. A first computing task may include operations 421 and 422 and be assigned to the ISM. A second computing task may include the equivocal operation 423 and be assigned to the central processor. A third computing task may include the off-loadable operation 424 and be assigned back to the ISM. This however, might involve a number of avoidable transfers (both of data and of control of the execution of the operations).

In the illustrated embodiment, the scheduler may assign the equivocal operation 423 to the ISM. In such an embodiment, the operations 421, 422, 423, and 424, may all be assigned to a first computing task 428 and may also be assigned to the ISM. In such an embodiment, the number of transfers may be reduced and the efficiency of the system increased. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

In the illustrated embodiment, the operation 425 may be classified as a host computable (HC) operation and may be not fit within the first or off-loadable computing task 428. Instead, a second computing task 429 may be created for operations that are to be assigned to the data node's central processor. Operation 426 may also be a host computable (HC) operation and placed within this second computing task 429.

Portion 430 of FIG. 4 shows that the scheduler may classify or categorize each operation of the larger computing task, but in this case operation #4 434 is not classified as an off-loadable operation, but instead a host-computable operation. For example, in this embodiment, operation #4 434 may be a different operation than operation #4 424, or the system may simply use a different classification scheme such that the same operation is classified differently. Regardless, portion 430 merely shows that, given different operation classifications, the larger computing task may be subdivided in different ways. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited. FIG. 6 provides a more detailed description of a possible embodiment of the process of sub-division.

Again, in the illustrated embodiment, operation #1 421 and operation #2 422 may both be classified as off-loadable (OL) operations, and may be considered part of a first smaller computing task 438 that will be assigned to the ISM. Operation #3 423, however, may be classified as an equivocal (E) operation and its assignment (both to a particular smaller computing task and/or processor) may not be so clear-cut.

However, as described above, operation #4 434 may be classified as a host computable operation that will be assigned to the central processor. In the illustrated embodiment, the scheduler may assign the equivocal operation 423 to the ISM (as was done in portion 420), and not the central processor (as may be done in an alternate embodiment). In such an embodiment, the operations 421, 422, and 423 may be assigned to a first computing task 438 and may also be assigned to the ISM.

In the illustrated embodiment, the operations 425 and 426 may again be classified as host computable (HC) operations. In such an embodiment, the operations 434, 425, and 426 may be included within the second computing task 439 and may be assigned to the data node's central processor.

As described above, in some embodiments, the system may generate the smaller computing tasks 448 and 449 of Portion 440. In the illustrated embodiment, of Portion 440 the grouping rules may differ from those of Portion 430. In such an embodiment, operation #3 423 may be grouped with host computable operation #4 434 and assigned to the second computing task 449. In such an embodiment, only operations 421 and 422 may be included within the first computing task 448. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

Further, it is understood that while only two smaller computing tasks were shown, in various embodiments, three or more computing tasks may be created out of a larger computing task. In yet another embodiment, a larger computing task may not be sub-divided (e.g., if all operations are of a single classification, etc.).

In yet another embodiment, a scheduler may be configured to determine if a chain of operations is really linear or sequential. In some embodiments, the scheduler may be configured re-order operations to increase efficiently or reduce the number of computing tasks, or number of data transfers. In the illustrated embodiment, an in-order scheme has been shown, but it is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

FIG. 5 is a flow chart of an example embodiment of a technique 500 in accordance with the disclosed subject matter. In various embodiments, the technique 500 may be used or produced by the systems such as those of FIG. 1, 2, or 7. Furthermore, portions of technique 500 may be used to create the data structures or classifications such as that of FIG. 3 or 4. Although, it is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited. It is understood that the disclosed subject matter is not limited to the ordering of or number of actions illustrated by technique 500.

Block 502 illustrates that, in one embodiment, a computing task may be received, as described above. In various embodiments, the computing task may include a plurality of operations, as described above. In various embodiments, one or more of the action(s) illustrated by this Block may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 of FIG. 1, as described above.

Block 504 illustrates that, in one embodiment, the computing task may be allocated to a data node, as described above. In some embodiments, the data node may include a central processor and an intelligent storage medium, as described above. In one such embodiment, the intelligent storage medium may include a controller processor and a memory, as described above. In various embodiments, one or more of the action(s) illustrated by this Block may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 or data nodes 108 of FIG. 1, as described above.

Block 506 illustrates that, in one embodiment, the computing task may be divided into at least a first chain of operations and a second chain of operations, as described above. In one embodiment, dividing may include categorizing each operation into at least a first category or a second category. In such an embodiment, an operation associated with the first category may generate an amount of output data that is less than an amount of input data, as described above. In such an embodiment, an operation associated with the second category may generate an amount of output data that is greater than an amount of input data, as described above. In another embodiment, dividing may include determining an operation at which the computing task transitions from operations of one category of operations and to operations of another category of operations, and dividing the computing task into different chains of operations at the operation, as described above.

In yet another embodiment, dividing may include classifying each operation into one or at least three categories, as described above. In such an embodiment, a first category may be associated with the central processor of the data node, a second category may be associated with the intelligent storage medium of the data node, and a third category may be associated with both the central processor and the intelligent storage medium of the data node, as described above. In such an embodiment, dividing may further include, if a current operation is associated with the third category, assigning the current operation to either the central processor of a data node or the intelligent storage medium of the data node, based upon a category associated with either a prior operation or a next operation, as described above. In various embodiments, one or more of the action(s) illustrated by this Block may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 of FIG. 1, as described above.

Block 508 illustrates that, in one embodiment, the first chain of operations may be assigned to the intelligent storage medium of the data node, as described above. In various embodiments, one or more of the action(s) illustrated by these Blocks may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 or data nodes 108 of FIG. 1, as described above.

Block 510 illustrates that, in one embodiment, an output location for an output data generated by the first chain of operations may be assigned, as described above. In various embodiments, assigning an output location may include: if a next operation is assigned to the central processor of the data node, dictate that an output data of the first chain of operations be stored in a memory of the data node, and if the next operation is assigned to the intelligent storage medium, dictate that an output data of the first chain of operations be stored in the intelligent storage medium, as described above. In various embodiments, one or more of the action(s) illustrated by this Block may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 of FIG. 1, as described above.

Block 512 illustrates that, in one embodiment, the second chain of operations may be assigned to the central processor of the data node, as described above. In various embodiments, one or more of the action(s) illustrated by these Blocks may be performed by the apparatuses or systems of FIG. 1, 2, or 7, the scheduler computing device 104 or data nodes 108 of FIG. 1, as described above.

FIG. 6 is a flowchart of an example embodiment of a technique 600 in accordance with the disclosed subject matter. Specifically, technique 600 illustrates one embodiment of a scheme for dividing a larger computing task into at least a first chain of operations and a second chain of operations. In various embodiments, the technique 600 may be used with or produced by the systems such as those of FIG. 1, 2, or 7. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

Block 602 illustrates that, in one embodiment, the larger chain of operations and the bookkeeping values of the division may be reset to known values. In the illustrated embodiment, the bookkeeping values may include: an index (i) tracking which operation is a prior, current or next operation, a start point (GroupStart) that may be a point or operation where the newer or current smaller computing task might start, and an operation type (OpType) or classification associated with the current smaller grouping task or the previous operation. In the illustrated embodiment, the OpType may be an ISM assigned or off-loaded computing task, and a host computed task, as described above. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

A current operation (Op[i]) may be selected for evaluation and classification. In various embodiments, the scheduler may “walk” though the chain of operations classifying each in turn.

Block 604 illustrates that, in one embodiment, the current operation may be examined to determine if it is an equivocal operation, or (more generally stated) of an OpType that is neither an off-loaded computing task nor a host computed task. If the current operation is not an equivocal operation, the flow of technique 600 may move to Block 605 for further evaluation. Conversely, if the current operation is an equivocal operation, the flow of technique 600 may move to Block 610.

Block 610 illustrates that, in one embodiment, it may be determined if the current operation is the last or final operation of the larger computing task. If not, Block 620 illustrates that, in one embodiment, the scheduler may move to and evaluate the next operation (e.g., i=i+1 or i++). If the current operation is the last operation, the chain of operations may be divided into an ISM assigned or off-loaded computing task and a host computed task, as described below.

Returning to Block 605, Block 605 illustrates that, in one embodiment, if the current operation is not an equivocal operation, technique 600 may determine if the operation type for the current group of computing tasks has been set yet (i.e. if the current OpType is not null or otherwise undefined). If the operation type (e.g., host or off-loaded, etc.) is not assigned, it may be because this is the first operation to be included in the current group of computing tasks. If the current operation is the first operation in the current computing task, technique 600 may proceed to Block 608. In Block 608, the operation type of the current group of computing tasks (i.e., the active OpType) may be set to the same classification as the current operation (e.g., an off-loaded computing task or a host computed task). Once the classification or OpType of the current group of computing tasks has been set, the flow of technique 600 may move to Block 610 for further evaluation, as described above.

If the current or active OpType has been previously defined, technique 600 may instead proceed from Block 605 to Block 606. Block 606 illustrates that, in one embodiment, the classification associated with the current operation may be compared to the current or active OpType associated with the current group of computing tasks. If the current operation (i.e., Op[i]) is of the same classification as the groups' classification (i.e., OpType), the current operation may be added to the current group, and the flow of technique 600 may move to Block 610 for further evaluation, as described above.

If the current operation (i.e., Op[i]) is of a different classification than the group's classification (i.e., OpType), the larger computing task may be split into two computing tasks (or another computing task, if two tasks already exist). Block 607 illustrates that, in one embodiment, the last operation (GroupStop) of the current computing task may be set to the previous operation (i.e., Op[i−1]), and the current computing task may be assigned as dictated by the associated OpType (e.g., off-loaded computing task, a host computed task, etc.). Further, a new group or computing task may be created (by setting GroupStart to the current operation). This new group or computing task may be associated with a classification of the current operation, as shown in Block 608.

In the illustrated embodiment, if the previous operation was an equivocal operation, the equivocal operation may be the last operation in the current computing task (e.g., as seen in Portion 430 of FIG. 4, etc.). In another, non-illustrated embodiment, the equivocal operation may become the first operation in the new computing task (e.g., as seen in Portion 440 of FIG. 4, etc.). In yet another embodiment, a more complex system of rules may determine to which computing task a previous equivocal operation (or string of equivocal operations) may be grouped. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

As described above, in Block 610 In the illustrated embodiment, a determination may be made as to whether or not the current operation is the last operation. As described above, if the current operation is not the last operation, the flow of technique 600 may proceed to Block 620 and the next operation may be processed. Conversely, if the current operation is the last operation, the flow of technique 600 may proceed to Block 612.

Block 612 illustrates that, in one embodiment, it may be determined if the OpType is set (i.e., was at least one operation not an equivocal operation?). If so, Block 614 illustrates that, in one embodiment, the OpType of the current computing task may be set randomly to either an off-loadable category or host-computable category. In another embodiment, other rules or assignment schemes may be employed. For example, a preference may be given to classifying the computing task as an off-loadable task. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

However, if OpType was set (e.g., either off-loadable category or host-computable category, etc.), Block 616 illustrates that, in one embodiment, the larger computing task may be divided into a task defined by the GroupStart variable and the current operation. In the illustrated embodiment, the newly defined smaller computing task may be assigned a classification of OpType.

Block 618 illustrates that, in one embodiment, the scheduler may end the evaluation or division process. The scheduler may then assign the smaller computing tasks or divided chains of operation to the respective processors, as described above. It is understood that the above is merely one illustrative example to which the disclosed subject matter is not limited.

FIG. 7 is a schematic block diagram of an information processing system 700, which may include semiconductor devices formed according to principles of the disclosed subject matter.

Referring to FIG. 7, an information processing system 700 may include one or more of devices constructed according to the principles of the disclosed subject matter. In another embodiment, the information processing system 700 may employ or execute one or more techniques according to the principles of the disclosed subject matter.

In various embodiments, the information processing system 700 may include a computing device, such as, for example, a laptop, desktop, workstation, server, blade server, personal digital assistant, smartphone, tablet, and other appropriate computers, etc. or a virtual machine or virtual computing device thereof. In various embodiments, the information processing system 700 may be used by a user (not shown).

The information processing system 700 according to the disclosed subject matter may further include a central processing unit (CPU), logic, or processor 710. In some embodiments, the processor 710 may include one or more functional unit blocks (FUBs) or combinational logic blocks (CLBs) 715. In such an embodiment, a combinational logic block may include various Boolean logic operations (e.g., NAND, NOR, NOT, XOR, etc.), stabilizing logic devices (e.g., flip-flops, latches, etc.), other logic devices, or a combination thereof. These combinational logic operations may be configured in simple or complex fashion to process input signals to achieve a desired result. It is understood that while a few illustrative examples of synchronous combinational logic operations are described, the disclosed subject matter is not so limited and may include asynchronous operations, or a mixture thereof. In one embodiment, the combinational logic operations may comprise a plurality of complementary metal oxide semiconductors (CMOS) transistors. In various embodiments, these CMOS transistors may be arranged into gates that perform the logical operations; although it is understood that other technologies may be used and are within the scope of the disclosed subject matter.

The information processing system 700 according to the disclosed subject matter may further include a volatile memory 720 (e.g., a Random Access Memory (RAM), etc.). The information processing system 700 according to the disclosed subject matter may further include a non-volatile memory 730 (e.g., a hard drive, an optical memory, a NAND or Flash memory, etc.). In some embodiments, either the volatile memory 720, the non-volatile memory 730, or a combination or portions thereof may be referred to as a “storage medium”. In various embodiments, the volatile memory 720 and/or the non-volatile memory 730 may be configured to store data in a semi-permanent or substantially permanent form.

In various embodiments, the information processing system 700 may include one or more network interfaces 740 configured to allow the information processing system 700 to be part of and communicate via a communications network. Examples of a Wi-Fi protocol may include, but are not limited to, Institute of Electrical and Electronics Engineers (IEEE) 802.11g, IEEE 802.11n, etc. Examples of a cellular protocol may include, but are not limited to: IEEE 802.16m (a.k.a. Wireless-MAN (Metropolitan Area Network) Advanced), Long Term Evolution (LTE) Advanced), Enhanced Data rates for GSM (Global System for Mobile Communications) Evolution (EDGE), Evolved High-Speed Packet Access (HSPA+), etc. Examples of a wired protocol may include, but are not limited to, IEEE 802.3 (a.k.a. Ethernet), Fibre Channel, Power Line communication (e.g., HomePlug, IEEE 1901, etc.), etc. It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

The information processing system 700 according to the disclosed subject matter may further include a user interface unit 750 (e.g., a display adapter, a haptic interface, a human interface device, etc.). In various embodiments, this user interface unit 750 may be configured to either receive input from a user and/or provide output to a user. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.

In various embodiments, the information processing system 700 may include one or more other devices or hardware components 760 (e.g., a display or monitor, a keyboard, a mouse, a camera, a fingerprint reader, a video processor, etc.). It is understood that the above are merely a few illustrative examples to which the disclosed subject matter is not limited.

The information processing system 700 according to the disclosed subject matter may further include one or more system buses 705. In such an embodiment, the system bus 705 may be configured to communicatively couple the processor 710, the volatile memory 720, the non-volatile memory 730, the network interface 740, the user interface unit 750, and one or more hardware components 760. Data processed by the processor 710 or data inputted from outside of the non-volatile memory 730 may be stored in either the non-volatile memory 730 or the volatile memory 720.

In various embodiments, the information processing system 700 may include or execute one or more software components 770. In some embodiments, the software components 770 may include an operating system (OS) and/or an application. In some embodiments, the OS may be configured to provide one or more services to an application and manage or act as an intermediary between the application and the various hardware components (e.g., the processor 710, a network interface 740, etc.) of the information processing system 700. In such an embodiment, the information processing system 700 may include one or more native applications, which may be installed locally (e.g., within the non-volatile memory 730, etc.) and configured to be executed directly by the processor 710 and directly interact with the OS. In such an embodiment, the native applications may include pre-compiled machine executable code. In some embodiments, the native applications may include a script interpreter (e.g., C shell (csh), AppleScript, AutoHotkey, etc.) or a virtual execution machine (VM) (e.g., the Java Virtual Machine, the Microsoft Common Language Runtime, etc.) that are configured to translate source or object code into executable code which is then executed by the processor 710.

The semiconductor devices described above may be encapsulated using various packaging techniques. For example, semiconductor devices constructed according to principles of the disclosed subject matter may be encapsulated using any one of a package on package (POP) technique, a ball grid arrays (BGAs) technique, a chip scale packages (CSPs) technique, a plastic leaded chip carrier (PLCC) technique, a plastic dual in-line package (PDIP) technique, a die in waffle pack technique, a die in wafer form technique, a chip on board (COB) technique, a ceramic dual in-line package (CERDIP) technique, a plastic metric quad flat package (PMQFP) technique, a plastic quad flat package (PQFP) technique, a small outline package (SOIC) technique, a shrink small outline package (SS OP) technique, a thin small outline package (TS OP) technique, a thin quad flat package (TQFP) technique, a system in package (SIP) technique, a multi-chip package (MCP) technique, a wafer-level fabricated package (WFP) technique, a wafer-level processed stack package (WSP) technique, or other technique as will be known to those skilled in the art.

Method steps may be performed by one or more programmable processors executing a computer program to perform functions by operating on input data and generating output. Method steps also may be performed by, and an apparatus may be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

In various embodiments, a computer readable medium may include instructions that, when executed, cause a device to perform at least a portion of the method steps. In some embodiments, the computer readable medium may be included in a magnetic medium, optical medium, other medium, or a combination thereof (e.g., CD-ROM, hard drive, a read-only memory, a flash drive, etc.). In such an embodiment, the computer readable medium may be a tangibly and non-transitorily embodied article of manufacture.

While the principles of the disclosed subject matter have been described with reference to example embodiments, it will be apparent to those skilled in the art that various changes and modifications may be made thereto without departing from the spirit and scope of these disclosed concepts. Therefore, it should be understood that the above embodiments are not limiting, but are illustrative only. Thus, the scope of the disclosed concepts are to be determined by the broadest permissible interpretation of the following claims and their equivalents, and should not be restricted or limited by the foregoing description. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the scope of the embodiments. 

What is claimed is:
 1. A scheduler computing device comprising: a computing task memory configured to store at least one computing task, wherein the computing task is to be executed by a data node of a distributed computing system, wherein the distributed computing system comprises at least one data node, each data node having a central processor and an intelligent storage medium, wherein the intelligent storage medium comprises a controller processor and a non-volatile memory; and a processor configured to reduce the transmittal of data between elements of the data node by: deciding whether to assign the computing task to be executed by either the central processor of the data node or the controller processor of the intelligent storage medium based, at least in part, upon an amount of output data associated with the computing task compared to an amount of input data associated with the computing task, wherein: when the amount of output data is greater than the amount of input data, assigned the computing task to the central processor of the data node; and when the amount of output data is less than or equal to the amount of input data, assigned the computing task to the controller processor of the intelligent storage medium.
 2. The scheduler computing device of claim 1, wherein the processor is configured to: assign a computing task to either the central processor of the data node or the intelligent storage medium of the data node, based, at least in part, upon an amount of input data associated with the computing task relative to an amount of output data associated with the computing task.
 3. The scheduler computing device of claim 1, wherein the processor is configured to: divide a larger computing task into one or more smaller computing tasks, wherein each of the computing tasks includes a chain of one or more operations, and wherein each smaller computing task is performed by either the central processor of the data node or the intelligent storage medium of the data node; classify each smaller computing task into one or at least two categories, wherein a first category is assigned to the central processor of the data node, and a second category is assigned to the intelligent storage medium of the data node; and based upon the category associated with a smaller computing task, assign each respective smaller computing task to either the central processor of the data node or the intelligent storage medium of the data node.
 4. The scheduler computing device of claim 1, wherein the processor is configured to: classify the computing task into one or at least three categories, wherein a first category is to be assigned to the central processor of the data node, a second category is to be assigned to the intelligent storage medium of the data node, and a third category can be assigned to either the central processor or the intelligent storage medium of the data node; and if a current computing task is associated with the third category, assign the current computing task to either the central processor of the data node or the intelligent storage medium of the data node, based upon a category associated with either a prior computing task or a next computing task.
 5. The scheduler computing device of claim 1, wherein each data node further comprises a main memory; and wherein the scheduler computing device is configured to dictate that an output data of the computing task be stored in either the main memory of the data node or the memory of the intelligent storage medium.
 6. The scheduler computing device of claim 1, wherein the distributed computing system further includes a second plurality of data nodes, each data node in the second plurality of data nodes comprising a central processor and a simple storage medium, wherein the simple storage medium includes a memory; and wherein the processor of the scheduler computing device is configured to: assign a computing task to a data node of the plurality of data nodes that includes intelligent storage mediums, or a data node of the plurality of data nodes that includes simple storage mediums, based, at least in part, upon which data node stores a piece of data associated with the computing task, and if the computing task is assigned to a data node of the plurality of data nodes that includes simple storage mediums, assigning an entire computing task to the central processor of the data node.
 7. A method comprising: receiving a computing task, wherein the computing task includes a plurality of operations; allocating the computing task to a data node, wherein the data node includes a central processor and an intelligent storage medium, and wherein the intelligent storage medium includes a controller processor and a non-volatile memory; dividing the computing task into at least a first chain of operations and a second chain of operations, wherein dividing the computing task includes determining for each chain of operations an amount of output data associated with a respective chain of operations and an amount of input data associated with the respective chain of operations; if, for a respective chain of operations, the amount of output data is less than the amount of input data, assigning the respective chain of operations to the intelligent storage medium of the data node; and if, for a respective chain of operations, the amount of output data is greater than the amount of input data, assigning the respective chain of operations to the central processor of the data node.
 8. The method of claim 7, wherein dividing includes: categorizing each operation into at least a first category or a second category; wherein an operation associated with the first category generates an amount of output data that is less than an amount of input data; and wherein an operation associated with the second category generates an amount of output data that is greater than an amount of input data.
 9. The method of claim 8, wherein dividing includes: determining an operation at which the computing task transitions from operations of one category of operations and to operations of another category of operations; and dividing the computing task into different chains of operations at the operation.
 10. The method of claim 7, wherein dividing includes: classifying each operation into one of at least three categories, wherein a first category is associated with the central processor of the data node, a second category is associated with the intelligent storage medium of the data node, and a third category is associated with both the central processor and the intelligent storage medium of the data node; and if a current operation is associated with the third category, assigning the current operation to either the central processor of a data node or the intelligent storage medium of the data node, based upon a category associated with either a prior operation or a next operation.
 11. The method of claim 7, further comprising: assigning an output location for an output data generated by the first chain of operations.
 12. The method of claim 11, wherein assigning an output location includes: if a next operation is assigned to the central processor of the data node, dictate that an output data of the first chain of operations be stored in a memory of the data node; and if the next operation is assigned to the intelligent storage medium, dictate that an output data of the first chain of operations be stored in the intelligent storage medium.
 13. A data node comprising: a central processor configured to execute at least one of a first set of operations upon data stored by an intelligent storage medium; the intelligent storage medium comprising: a memory configured to store data in a semi-permanent manner, and a controller processor configured to execute at least one of a second set of operations upon data stored by the intelligent storage medium; and a network interface configured to receive a plurality of operations from a scheduling computing device; and wherein the data node is configured to: divide the computing task into at least the first set of operations and the second set of operations based, at least in part, upon an amount of output data associated with a respective set of operations compared to an amount of input data associated with the respective set of operations, if, for a respective set of operations, the amount of output data is less than the amount of input data, assign the respective set of operations to the central processor for execution, and if, for a respective set of operations, the amount of output data is greater than the amount of input data, assigning the respective set of operations to the intelligent storage medium for execution.
 14. The data node of claim 13, wherein the data node is configured to assign an operation to either the first set of operations or the second set of operations, based, at least in part, upon an amount of input data associated with the operation relative to an amount of output data associated with the operation.
 15. The data node of claim 13, wherein all of the plurality of operations are included in the second set of operations, and the first set of operations is empty; and wherein the intelligent storage medium is configured to execute all of the plurality of operations.
 16. The data node of claim 13, wherein that data node comprises a main memory configured to store data in a temporary manner; and wherein an output data associated with the operation is stored in either the main memory of the data node or the memory of the intelligent storage medium.
 17. The data node of claim 16, wherein the data node is configured to: if a next operation is assigned to the central processor, store the output data in the main memory of the data node; and if a next operation is assigned to the central processor, store the output data in the memory of the intelligent storage medium.
 18. The data node of claim 16, wherein the data node is configured to associate an output assignment with the second set of operations; and wherein the data node is configured to, in response to the output assignment, store the output data in the main memory of the data node or the memory of the intelligent storage medium.
 19. The data node of claim 13, wherein the central processor is capable of executing the second set of operations. 